AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
نویسندگان
چکیده
منابع مشابه
Automata over a Binary Alphabet Generating Free Groups of Even Rank
We construct automata over a binary alphabet with 2n states, n ≥ 2, whose states freely generate a free group of rank 2n. Combined with previous work, this shows that a free group of every finite rank can be generated by finite automata over a binary alphabet. We also construct free products of cyclic groups of order two via such automata.
متن کاملUnambiguous Finite Automata over a Unary Alphabet
Nondeterministic finite automata (NFA) with at most one accepting computation on every input string are known as unambiguous finite automata (UFA). This paper considers UFAs over a one-letter alphabet, and determines the exact number of states in DFAs needed to represent unary languages recognized by n-state UFAs in terms of a new number-theoretic function g̃. The growth rate of g̃(n), and theref...
متن کاملTwo-sided Pushdown Automata over Free Groups
In the two-sided pushdown automata discussed in this paper, their two-sided pushdowns are introduced over free groups rather than free monoids. It is demonstrated that these automata with pushdowns introduced in this way characterize the family of recursively enumerable languages.
متن کاملAutomata generating free products of groups of order 2
We construct a family of automata with n states, n ≥ 4, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.
متن کاملSubstitutions over Infinite Alphabet Generating (-β)-Integers
This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (−β )-expansions. We give an admissibility criterion for more general case of (−β )-expansions and discuss the properties of the set of (−β )-integers, denoted by Z−β . We give a description of distances within Z−β and show that this set can be coded by an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2011
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196711006194